Iterated Weak Dominance in Strictly Competitive Games of Perfect Information

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterated Weak Dominance in Strictly Competitive Games of Perfect Information

We prove that any strictly competitive perfect-information two-person game with n outcomes is solvable in n−1 steps of elimination of weakly dominated strategies— regardless of the length of the game tree. The given bound is shown to be tight using a variant of Rosenthal's centipede game.

متن کامل

Iterated weak dominance and subgame dominance

In this paper, we consider finite normal form games satisfying transference of decisionmaker indifference. We show that any set of strategies surviving k rounds of elimination of some weakly dominated strategies can be reduced to a set of strategies equivalent to the set of strategies surviving k rounds of elimination of all weakly dominated strategies in every round by (at most k) further roun...

متن کامل

Iterated Weaker-than-Weak Dominance

We introduce a weakening of standard gametheoretic dominance conditions, called δdominance, which enables more aggressive pruning of candidate strategies at the cost of solution accuracy. Equilibria of a game obtained by eliminating a δ-dominated strategy are guaranteed to be approximate equilibria of the original game, with degree of approximation bounded by the dominance parameter, δ. We can ...

متن کامل

Iterated strict dominance in general games

We offer a definition of iterated elimination of strictly dominated strategies (IESDS∗) for games with (in)finite players, (non)compact strategy sets, and (dis)continuous payoff functions. IESDS∗ is always a well-defined order independent procedure that can be used to solve Nash equilibrium in dominance-solvable games. We characterize IESDS∗ by means of a “stability” criterion, and offer a suff...

متن کامل

Adaptive Learning and Iterated Weak Dominance

This article addresses the idea that rational players should not play iteratively weakly dominated strategies by showing that when a particular type of adaptive learning process converges, then players must have learned to play strategy profiles equivalent to those that survive iterated nice weak dominance and, for certain games, equivalent to those that survive iterated weak dominance. For gam...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Economic Theory

سال: 2002

ISSN: 0022-0531

DOI: 10.1006/jeth.2001.2958